Maximal set - PDFSEARCH.IO - Document Search Engine

Maximal set
Results: 92

#	Item
21	On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2014-04-14 14:04:38 NP-complete problems Graph theory Network theory Edsger W. Dijkstra Shortest path problem Maximal independent set Independent set Matching Bipartite graph Degree Graph Line graph
22	Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:28 Graph coloring Combinatorial optimization Distributed computing Matching Maximal independent set Edge coloring
23	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
24	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Oblivious data structure Maximal independent set
25	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover
26	Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:23 Analysis of algorithms Balls into bins With high probability Randomized algorithm Time complexity Chernoff bound Maximal independent set EdmondsPruhs protocol
27	Free idempotent generated semigroups and partial endomorphism monoids of free G -acts Dandan Yang York, JanuaryDandan Yang ) Add to Reading List Source URL: www-users.york.ac.uk Language: English - Date: 2016-05-17 05:02:00 Semigroup theory Algebraic structures Semigroup Biordered set Idempotent Monoid Transformation semigroup Maximal subgroup Idempotence Magma Semigroup with involution Inverse semigroup
28	eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System Thomas Locher, Stefan Schmid, Roger Wattenhofer {lochert, schmiste, wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory (TIK), ETH Zuri Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:45 Distributed data storage Clique Chord Kademlia Distributed hash table Tapestry Adolescent cliques Content addressable network Pastry Clique percolation method Maximal independent set
29	Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 NP-complete problems Maximal independent set Treewidth Arboricity Dominating set Planar graph Independent set Matching Graph minor Bipartite graph Line graph Planar separator theorem
30	Fast Distributed Network Decompositions and Covers Baruch Awerbuch y Bonnie Berger z David Peleg { Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:24 NP-complete problems Graph coloring Matroid theory Graph connectivity Ear decomposition Neighbourhood Degeneracy Maximal independent set Independent set Bridge Graph theory Treewidth